Computing Vergne polarizing subalgebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness in the Kashiwara - Vergne conjecture

We prove that a universal symmetric solution of the Kashiwara-Vergne conjecture is unique up to order one. In the Appendix by the second author, this result is used to show that solutions of the Kashiwara-Vergne conjecture for quadratic Lie algebras existing in the literature are not universal.

متن کامل

Exponential Baker-campbell-hausdorff Formula and Compressed Kashiwara-vergne Conjecture

Abstract. The classical Baker-Campbell-Hausdorff formula gives a recursive way to compute the Hausdorff series H = log(ee ) for non-commuting X, Y . Formally H lives in a completion L̂ of the free Lie algebra L generated by X, Y . We prove that there are F, G ∈ [L̂, L̂] such that H = e Xe + eY e. We describe explicitly all symmetric solutions to the Kashiwara-Vergne conjecture in Lie algebras L, w...

متن کامل

Covariant Presheaves and Subalgebras

For small involutive and integral quantaloids Q it is shown that covariant presheaves on symmetric Q-categories are equivalent to certain subalgebras of a speci c monad on the category of symmetric Q-categories. This construction is related to a weakening of the subobject classi er axiom which does not require the classi cation of all subalgebras, but only guarantees that classi able subalgebra...

متن کامل

Low n Boolean Subalgebras

Every lown Boolean algebra, for 1 ≤ n ≤ 4, is isomorphic to a computable Boolean algebra. It is not yet known whether the same is true for n > 4. However, it is known that there exists a low5 subalgebra of the computable atomless Boolean algebra which, when viewed as a relation on the computable atomless Boolean algebra, does not have a computable copy. We adapt the proof of this recent result ...

متن کامل

Closure Operators and Subalgebras

In this article we present several logical schemes. The scheme SubrelstrEx concerns a non empty relational structure A, a set B, and a unary predicate P, and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P[x] provided the following conditions are met: • P[B], • B ∈ the carrier of A. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2014

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081087.2014.880434